Achieving Fault-Tolerant Multicast in Injured Wormhole-Routed Tori and Meshes Based on Euler Path Construction

نویسندگان

  • Yu-Chee Tseng
  • Ming-Hour Yang
  • Tong-Ying Tony Juang
چکیده

Recently, wormhole routers with multi-destination capability have been proposed to support fast multicast in a multi-computer network. To avoid communication deadlock, existing results have proposed to construct a Hamilton path, Euler path, trip, or their variants, in the network, perhaps with some degree of support of virtual channels 1, 14, 15, 18, 23]. In this paper, we identify that a network which is itself Eulerian or is Eulerian after some links are removed, can enjoy the multi-destination capability without support of virtual channels. From this definition , we then develop several techniques to achieve fault-tolerant multicast in a torus/mesh of any dimension with regular fault patterns (such as single node, block, L-shape, T-shape, +-shape, U-shape, and H-shape) and even irregular fault patterns. The result improves over existing results on the requirement of support of virtual channels and fault-tolerant capability. Simulation results on tori are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Euler-Path-Based Multicasting Model for Wormhole-Routed Networks: Its Applications to Damaged 2D Tori and Meshes

In this paper, we develop a new multicasting model for wormhole-routed networks based on the concept of Euler path in graph theory. The model can support multiple multicasts freely from deadlock and can be applied to any network which is Eulerian or is Eulerian after some links being removed. In particular, we demonstrate the power of this model by showing its fault-tolerant capability in suppo...

متن کامل

An Euler-Path-Based Multicasting Model for Wormhole-Routed Networks with Multi-Destination Capability

Recently, wormhole routers with multi-destination capability have been proposed to support fast multicast in a multi-computer network. In this paper, we develop a new multicasting model for such networks based on the concept of Euler path/circuit in graph theory. The model can support multiple concurrent multicasts freely from deadlock and can be applied to any network which is Eulerian or is E...

متن کامل

A Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes

In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of th...

متن کامل

Construction of Edge-Disjoint Spanning Trees in the Torus and Application to Multicast in Wormhole-Routed Networks

A tree-based multicast algorithm for wormhole-routed torus networks, which makes use of multiple edge-disjoint spanning trees is presented. A technique for constructing two spanning trees in 2-dimensional torus networks is described. It is formally proven that this construction produces two edge-disjoint spanning trees in any 2-D torus network. Compared with an algorithm for construction of mul...

متن کامل

Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels

This paper addresses the problem of fault-tolerant mul-ticast routing in wormhole-routed multicomputers. We present a new pseudo-Hamiltonian path-based routing methodology for constructing deadlock-free multicast routing algorithms requiring no virtual channels. This technique is applied to construct the rst fault-tolerant multicast routing algorithm for the mesh that requires no virtual channe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 48  شماره 

صفحات  -

تاریخ انتشار 1999